Complexity of Indefinite Elliptic Problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Indefinite Elliptic Problems By Arthur

This paper deals with the approximate solution of a linear regularly-elliptic 2mth-order boundary-value problem Lu = f, with / 6 Hr(Q) for r > —m. Suppose that the problem is indefinite, i.e., the variational form of the problem involves a weaklycoercive bilinear form. Of particular interest is the quality of the finite element method (FEM) of degree k using n inner products of /. The error of ...

متن کامل

The Complexity of Indefinite Elliptic Problems with Noisy Data

We study the complexity of second-order indeenite elliptic problems ?div(aru) + bu = f (with homogeneous Dirichlet boundary conditions) over a d-dimensional domain , the error being measured in the H 1 (()-norm. The problem elements f belong to the unit ball of W r;p ((), where p 2 2; 1] and r > d=p. Information consists of (possibly-adaptive) noisy evaluations of f , a, or b (or their derivati...

متن کامل

Asymmetric Elliptic Problems with Indefinite Weights

– We prove the existence of a first nontrivial eigenvalue for an asymmetric elliptic problem with weights involving the laplacian (cf. (1.2) below) or more generally the p-laplacian (cf. (1.3) below). A first application is given to the description of the beginning of the Fučik spectrum with weights for these operators. Another application concerns the study of nonresonance for the problems (1....

متن کامل

Compact Embeddings and Indefinite Semilinear Elliptic Problems

Our purpose is to find positive solutions u ∈ D(R ) of the semilinear elliptic problem −∆u = h(x)u for 2 < p. The function h may have an indefinite sign. Key ingredients are a h-dependent concentration-compactness Lemma and a characterization of compact embeddings of D(R ) into weighted Lebesgue spaces.

متن کامل

Domain Decomposition Algorithms for Indefinite Elliptic Problems

Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We first consider an additive Schwarz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1986

ISSN: 0025-5718

DOI: 10.2307/2007987